Randomized algorithms - PDFSEARCH.IO - Document Search Engine

Randomized algorithms
Results: 419

#	Item
181	70 CHAPTER 7. MAXIMAL INDEPENDENT SET Remarks: • Computing a maximum independent set (MaxIS) is a notoriously difficult Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Combinatorial optimization NP-complete problems Routing algorithms Search algorithms Matching Randomized algorithm Graph coloring Connectivity Dominating set Mathematics Theoretical computer science Graph theory
182	1 Complexity of Algorithms Lecture Notes, SpringPeter G´acs Add to Reading List Source URL: www.cs.elte.hu Language: English - Date: 2010-10-17 05:06:21 Complexity classes Analysis of algorithms Probabilistic complexity theory Computational resources NP Time complexity P Randomized algorithm Theory of computation Theoretical computer science Computational complexity theory Applied mathematics
183	CCCG 2011, Toronto ON, August 10–12, 2011 Algorithms for Bivariate Majority Depth Dan Chen∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:15 Euclidean plane geometry Polytopes Polyhedra Arrangement of lines K-set Dual polyhedron Randomized algorithm Sweep line algorithm Polygon Geometry Mathematics Discrete geometry
184	Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices Ioannis Koutis1 , Alex Levin2 , and Richard Peng3 1 Computer Science Department, University of Puerto Rico, Río Piedras Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2012-02-13 21:14:04 Analysis of algorithms NP-complete problems Probabilistic complexity theory Randomized algorithm Minor SL Degree Graph partition Time complexity Theoretical computer science Graph theory Computational complexity theory
185	Interference-Resilient Information Exchange * Seth Gilbert Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2009-11-24 09:47:54 Selection algorithm Distributed data storage Mathematics Applied mathematics Computer science Binary trees Tango tree Ternary tree Analysis of algorithms Probabilistic complexity theory Randomized algorithm
186	HR: when the computer does the recruiting By Jessica Agache-Gorse Relying on algorithms to uncover a precious jewel: a secret weapon used by an increasing number of HR departments. At a time when new technology has resul Add to Reading List Source URL: www.knack.it Language: English - Date: 2014-12-01 12:09:44 Predictive analytics Mathematics Applied mathematics Statistics Randomized algorithm Algorithm characterizations Algorithm Mathematical logic Theoretical computer science
187	114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Network theory Search algorithms Graph theory Communication Communication complexity Quantum complexity theory Shortest path problem Randomized algorithm Breadth-first search Theoretical computer science Mathematics Applied mathematics
188	Chapter 7 Maximal Independent Set In this chapter we present a highlight of this course, a fast maximal independent set (MIS) algorithm. The algorithm is the first randomized algorithm that we study in this class. In di Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Combinatorial optimization Routing algorithms Search algorithms Matching Randomized algorithm Graph coloring Connectivity Graph A* search algorithm Mathematics Theoretical computer science Graph theory
189	CCCG 2011, Toronto ON, August 10–12, 2011 Algorithms for Bivariate Majority Depth Dan Chen∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:15 Euclidean plane geometry Polytopes Polyhedra Arrangement of lines K-set Dual polyhedron Randomized algorithm Sweep line algorithm Polygon Geometry Mathematics Discrete geometry
190	Concepts and Algorithms for Polygonal Simplification Jonathan D. Cohen Department of Computer Science, The Johns Hopkins University 1. INTRODUCTION 1.1 Motivation Add to Reading List Source URL: www.cs.jhu.edu Language: English - Date: 2000-11-14 11:05:31 Polygon mesh Visual arts Tessellation Vertex 3D modeling Level of detail Polyhedron Randomized algorithm Triangle strip 3D computer graphics Geometry Computing

UPDATE